Decision tree design by simulated annealing

Lighting Design by Simulated Annealing

In this paper, we present a lighting design framework for glossy real objects, starting from the reflectance field of an object. Using existing digital imaging software, the lighting designer paints the desired illumination distribution on a photograph of an object. This painted-on illumination is used to determine the light intensities which produce a shading of the real object matching the de...

Decision-Theoretic Simulated Annealing

The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated annealing task decision-theoretically for the first time, allowing the user to explicitly define utilities of time and solution quality. We then demonstrate the application of reinforcement learning techniques towards appr...

Real Time Multiagent Decision Making by Simulated Annealing

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

Optimization by simulated annealing.

There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...